The Reversible Nearest Particle System on a Finite Interval ∗
نویسندگان
چکیده
In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in different order, from logarithmic to exponential, according to the intensity of interaction. In particular, at the critical case, the first hitting time increases in a polynomial order.
منابع مشابه
The Reversible Nearest Particle System on a Finite Set ∗
In this paper we study the one-parameter family of attractive reversible nearest particle systems on {1, 2, · · · , N}. Denote by σN the time that the system first hits the empty set. Then, σN has a logarithmic increasing rate as the parameter λ is small enough, but an exponential increasing rate as λ is large enough. Especially, it has a polynomial increasing rate in the critical case, i.e. λ ...
متن کاملFuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملFinite element model updating of a geared rotor system using particle swarm optimization for condition monitoring
In this paper, condition monitoring of a geared rotor system using finite element (FE) model updating and particle swarm optimization (PSO) method is onsidered. For this purpose, employing experimental data from the geared rotor system, an updated FE model is obtained. The geared rotor system under study consists of two shafts, four bearings, and two gears. To get the experimental data, iezoel...
متن کاملA New Hybrid Approach of K-Nearest Neighbors Algorithm with Particle Swarm Optimization for E-Mail Spam Detection
Emails are one of the fastest economic communications. Increasing email users has caused the increase of spam in recent years. As we know, spam not only damages user’s profits, time-consuming and bandwidth, but also has become as a risk to efficiency, reliability, and security of a network. Spam developers are always trying to find ways to escape the existing filters therefore new filters to de...
متن کاملSoftware Cost Estimation by a New Hybrid Model of Particle Swarm Optimization and K-Nearest Neighbor Algorithms
A successful software should be finalized with determined and predetermined cost and time. Software is a production which its approximate cost is expert workforce and professionals. The most important and approximate software cost estimation (SCE) is related to the trained workforce. Creative nature of software projects and its abstract nature make extremely cost and time of projects difficult ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005